Asymptotic Formulaae in Combinatory Analysis

Asymptotic Properties of Combinatory Logic

Combinatory Hybrid Elementary Analysis of Text

We propose the CHEAT approach to any corpus analysis or annotation challenge: Combinatory Hybrid Elementary Analysis of Text. The idea is: sit back and get others to do the work, then simply learn from their results. Wikipedia explains that “In computer science, an intelligent agent (IA) is a software agent that exhibits some form of artificial intelligence that assists the user and will act on...

analysis of power in the network society

اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...

Typing in reflective combinatory logic

We study the syntax of Artemov’s Reflective Combinatory Logic RCL→. We provide the explicit definition of types for RCL→ and prove that every well-formed term has a unique type. We establish that the typability testing and detailed type restoration can be done in polynomial time and that the derivability relation for RCL→ is decidable and PSPACE-complete. These results also formalize the intend...

Normal Forms in Combinatory Logic

Let R be a convergent term rewriting system, and let CR-equality on (simply typed) combinatory logic terms be the equality induced by βηRequality on terms of the (simply typed) lambda calculus under any of the standard translations between these two frameworks for higher-order reasoning. We generalize the classical notion of strong reduction to a reduction relation which generates CR-equality a...